LECTURE NOTES ON Large sets of t-designs

Preface The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In these notes, we describe the method and show how it is employed to obtain large sets. We will present almost all of the existence results and recursive constructions which have been found by this method.